Embedding Static Analysis into Tableaux and Sequent Based Frameworks
نویسنده
چکیده
In this paper we present a method for embedding static analysis into tableaux and sequent based frameworks. In these frameworks, the information flows from the root node to the leaf nodes. We show that the existence of free variables in such frameworks introduces a bi-directional flow, which can be used to collect and synthesize arbitrary information. We use free variables to embed a static program analysis in a sequent style theorem prover used for verification of Java programs. The analysis we embed is a reaching definitions analysis, which is a common and well-known analysis that shows the potential of our method. The achieved results are promising and open up for new areas of application of tableaux and sequent based theorem provers.
منابع مشابه
Evaluating Automated Theorem Provers for First-Order Modal Logics
First-order modal logics have many applications, e.g., in planning, natural language processing, program verification, querying knowledge bases, and modeling communication. This paper gives an overview of several new implementations of theorem provers for first-order modal logics based on different proof calculi. Among these calculi are the standard sequent calculus, a prefixed tableau calculus...
متن کاملOn Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
P. Baumgartner, R. Hähnle & J. Posegga, ed., 4 International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX 95), LNAI 918, pp. 106–121, c ©Springer Verlag, 1995 Abstract. We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof justifying hi...
متن کاملImplementing and Evaluating Provers for First-order Modal Logics
While there is a broad literature on the theory of firstorder modal logics, little is known about practical reasoning systems for them. This paper presents several implementations of fully automated theorem provers for first-order modal logics based on different proof calculi. Among these calculi are the standard sequent calculus, a prefixed tableau calculus, an embedding into simple type theor...
متن کاملEmbedding Display Calculi into Logical Frameworks: Comparing Twelf and Isabelle
We compare several methods of implementing the display (sequent) calculus RA for relation algebra in the logical frameworks Isabelle and Twelf. We aim for an implementation enabling us to formalise within the logical framework proof-theoretic results such as the cut-elimination theorem for RA and any associated increase in proof length. We discuss issues arising from this requirement.
متن کاملA Sequent Calculus for Bilattice-Based Logic and Its Many-Sorted Representation
We introduce a sequent calculus for bilattice-based annotated logic (BAL). We show that this logic can be syntactically and semantically translated into a fragment MSL∗ of conventional many-sorted logic MSL. We show deductive equivalence of sequent calculus for BAL and sequent calculus for MSL∗.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005